On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
نویسنده
چکیده
In this paper, we formulate and investigate the following problem: given integers d, k and r where k > r ≥ 1, d ≥ 2, and a prime power q, arrange d hyperplanes on Fq to maximize the number of r-dimensional subspaces of Fq each of which belongs to at least one of the hyperplanes. The problem is motivated by the need to give tighter bounds for an error-tolerant pooling design based on finite vector spaces.
منابع مشابه
The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design
In this paper, we construct a d-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s−1), s−1)-subspaces and the tighter bounds for an error-tolerant pooling design. Moreover, we give the tighter analysis of our construction by the results of the arrangement problem. Additionally, by comparing our construction with...
متن کاملIncorporating location, routing, and inventory decisions in a bi-objective supply chain design problem with risk-pooling
This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to c...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملA New Formulation for Cost-Sensitive Two Group Support Vector Machine with Multiple Error Rate
Support vector machine (SVM) is a popular classification technique which classifies data using a max-margin separator hyperplane. The normal vector and bias of the mentioned hyperplane is determined by solving a quadratic model implies that SVM training confronts by an optimization problem. Among of the extensions of SVM, cost-sensitive scheme refers to a model with multiple costs which conside...
متن کاملNew Construction of Error-Tolerant Pooling Designs
We present a new class of error-tolerant pooling designs by constructing d−disjunct matrices associated with subspaces of a finite vector space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008